Search for an emission line of a gravitational wave background
نویسندگان
چکیده
In light of the history of research on an electromagnetic wave spectrum, a sharp emission line of gravitational wave background (GWB) would be an interesting observational target. Here we study an efficient method to detect a line GWB by correlating data of multiple ground-based detectors. We find that the width of frequency bin for coarse graining is a critical parameter, and, with the commonly used value 0.25 Hz, the signal-to-noise ratio could be decreased by up to a factor of 6.6, compared with a finer width of 0.02 Hz. By reanalyzing the existing data with a smaller bin width, we might detect a precious line signal from the early Universe.
منابع مشابه
ar X iv : 1 50 3 . 00 35 4 v 1 [ gr - q c ] 1 M ar 2 01 5 Search for an emission line of a gravitational wave background
In the light of the history of researches on electromagnetic wave spectrum, a sharp emission line of gravitational-wave background (GWB) would be an interesting observational target. Here we study an efficient method to detect a line GWB by correlating data of multiple ground-based detectors. We find that the width of frequency bin for coarse graining is a critical parameter, and the commonly-u...
متن کاملSearch method for an emission line of a GW background
A sharp emission line of a gravitational-wave background (GWB) would be an interesting observational target. Here we study an efficient method to detect a line GWB by correlating data of multiple GW detectors. We find that the width of frequency bin in the data analysis is a critical parameter, and, with the commonly-used value 0.25 Hz, the signal-to-noise ratio could be decreased by up to a fa...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کامل